An upper bound on the neutron-deuteron2S scattering length by anS- matrix method
نویسندگان
چکیده
منابع مشابه
An Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملExtracting the neutron-neutron scattering length — recent developments
The experimental and theoretical issues and challenges for extracting the neutron-neutron scattering length are discussed. Particular emphasis is placed on recent results and their impact on the field. Comments are made regarding current experimental and theoretical possibilities. PACS numbers: 11.30.Hv, 13.75.Cs, 21.30.Cb, 21.45.Bc, 25.40.Dn, 14.20.Dh
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملan upper bound on the first zagreb index in trees
in this paper we give sharp upper bounds on the zagreb indices and characterize all trees achieving equality in these bounds. also, we give lower bound on first zagreb coindex of trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Il Nuovo Cimento
سال: 1965
ISSN: 0029-6341,1827-6121
DOI: 10.1007/bf02750470